Accelerating Speculative Execution in High-Level Synthesis with Cancel Tokens
نویسندگان
چکیده
We present an improved method for scheduling speculative data paths which relies on cancel tokens to undo computations in misspeculated paths. Performancewise, this method is considerably faster than lenient execution, and faster than any other known approach applicable for general (including non-pipelined) computation structures. We present experimental evidence obtained by implementing our method as part of the high-level language hardware/software compiler COMRADE.
منابع مشابه
Synthesizing FPGA Circuits from Parallel Programs
From silicon to science : the long road to production reconfigurable supercomputing p. 2 The von Neumann syndrome and the CS education dilemma p. 3 Optimal unroll factor for reconfigurable architectures p. 4 Programming reconfigurable decoupled application control accelerator for mobile systems p. 15 DNA physical mapping on a reconfigurable platform p. 27 Hardware BLAST algorithms with multi-se...
متن کاملModeling speculative execution and availability analysis with Boolean expressions
Emerging design problems are prompting the use of instruction-level parallelism techniques during the high-level synthesis (HLS) of ASICs or ASIPs in order to meet tight time-constraints. Techniques like code motion and speculative execution can grant time-constraint satisfiability because they can shorten schedule lengths. The mechanism for inducing code motion and speculative execution relies...
متن کاملA Reordering Technique for E cient Code Motion
Emerging design problems are prompting the use of code motion and speculative execution in high-level synthesis to shorten schedules and meet tight timeconstraints. However, some code motions are not worth doing from a worst-case execution perspective. We propose a technique that selects the most promising code motions, thereby increasing the density of optimal solutions in the search space.
متن کاملSynthesis of Conditional Behaviors Using Hierarchical Conditional Dependency Graphs and Constraint Logic Programming
This paper presents a new high-level synthesis (HLS) approach which addresses the problem of synthesis of conditional behaviors. In proposed methodology, the conditional behaviors are represented by Hierarchical Conditional Dependency Graphs (HCDG) and synthesized using derived Constraints Logic Programming (CLP) models. Our synthesis methods exploit multicycle operations and chaining as well a...
متن کاملSoft-Error Tolerant Datapath Synthesis Based on Speculative Resource Sharing in Triple Algorithm Redundancy
As semiconductor technologies have advanced, the reliability problem caused by soft-errors is becoming one of the serious issues in LSIs. In this paper, we propose a method to synthesize soft-error tolerant application-specific datapaths via high-level synthesis. The novel feature of our method is speculative resource sharing between the retry parts and the secondary parts for hardware/time ove...
متن کامل